Disjoint multi mobile agent itinerary planning for big data analytics

Sensor networks are often part of a cyber-physical system. A large-scale sensor network often involves big data collection and data fusion. The agent technology has drawn much attention in wireless sensor networks (WSNs) to perform data fusion and energy balancing. Existing multi-agent itinerary algorithms are either time-consuming or too complicated in practice. In this paper, we design a routing itinerary planning scheme for the multi-agent itinerary problem by constructing the spanning tree of WSN nodes. First, we build a multi-agent-based distributed WSN (DWSN) model and energy consumption model. Second, we present a novel routing itinerary algorithm named DMAIP, which can group all the sensor nodes into multiple itineraries for agents. We also extend DMAIP and design DMAIP-E, which can avoid long-distance transmission in DMAIP. Our evaluation results demonstrate that our algorithms are better in terms of life cycle and energy consumption than the existing DWSN data collecting schemes.